Mutation testing from probabilistic and stochastic finite state machines
نویسندگان
چکیده
منابع مشابه
Mutation testing from probabilistic and stochastic finite state machines
Specification mutation involves mutating a specification, and for each mutation a test is derived that distinguishes the behaviours of the mutated and original specifications. This approach has been applied with finite state machines based models. This paper extends mutation testing to finite state machine models that contain non-functional properties. The paper describes several ways of mutati...
متن کاملTesting Finite State Machines Presenting Stochastic Time and Timeouts
In this paper we define a formal framework to test implementations that can be represented by the class of finite state machines introduced in [10]. First, we introduce an appropriate notion of test. Next, we provide an algorithm to derive test suites from specifications such that the constructed test suites are sound and complete with respect to two of the conformance relations introduced in [...
متن کاملFormal testing from timed finite state machines
The scale and heterogeneity of current systems make impossible for developers to have an overall view of them. Thus, it is difficult to foresee those errors that are either critical or more probable. In this context, formal testing techniques provide systematic procedures to check implementations in such a way that the coverage of critical parts/aspects of the system under test depends less on ...
متن کاملVerifying Finite State Machines in Probabilistic Environments
Abstract: Finite state machines are considered in a probabilistic environment that is generated by a Markov chain. An expressive temporal logic is introduced for specifying complex requirements that the FSM should satisfy in the given environment. The corresponding model checking algorithm is described and its symbolic implementation is sketched. Throughout the paper, the method is illustrated ...
متن کاملStructural transformations of probabilistic finite state machines
Probabilistic finite state machines have recently emerged as a viable tool for modelling and analysis of complex non-linear dynamical systems. This paper rigorously establishes such models as finite encodings of probability measure spaces defined over symbol strings. The well known Nerode equivalence relation is generalized in the probabilistic setting and pertinent results on existence and uni...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Systems and Software
سال: 2009
ISSN: 0164-1212
DOI: 10.1016/j.jss.2009.06.030